Correspondence with Cumulative Similiarity Transforms

نویسندگان

  • Trevor Darrell
  • Michele Covell
چکیده

ÐA local image transform based on cumulative similarity measures is defined and is shown to enable efficient correspondence and tracking near occluding boundaries. Unlike traditional methods, this transform allows correspondences to be found when the only contrast present is the occluding boundary itself and when the sign of contrast along the boundary is possibly reversed. The transform is based on the idea of a cumulative similarity measure which characterizes the shape of local image homogeneity; both the value of an image at a particular point and the shape of the region with locally similar and connected values is captured. This representation is insensitive to structure beyond an occluding boundary but is sensitive to the shape of the boundary itself, which is often an important cue. We show results comparing this method to traditional least-squares and robust correspondence matching. Index TermsÐImage correspondence, stereo, motion, contour tracking.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reading the Envelope: Understanding Visual Similarity Matrices

Visual Similiarity Matrices are an approach to representing the structure of large graphs. Different node ordering strategies have been shown to generate characteristic patterns in the resulting dotplot. This paper studies the effect of graph properties on the characteristic pattern. The goal is to derive useful, quantitative information about the graph from the VSM. We focus on small-world gra...

متن کامل

Laplace Transforms for Numericalinversion via Continued

It is often possible to e ectively calculate cumulative distribution functions and other quantities of interest by numerically inverting Laplace transforms. However, to do so it is necessary to compute the Laplace transform values. Unfortunately, convenient explicit expressions for required transforms are often unavailable. In that event, we show that it is sometimes possible to nd continued-fr...

متن کامل

Non-parametric Local Transforms for Computing Visual Correspondence

We propose a new approach to the correspondence prob lem that makes use of non parametric local transforms as the basis for correlation Non parametric local transforms rely on the relative order ing of local intensity values and not on the intensity values themselves Correlation using such transforms can tolerate a signi cant number of outliers This can result in improved performance near objec...

متن کامل

Non - parametric Local Transforms forComputing Visual

We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms rely on the relative ordering of local intensity values, and not on the intensity values themselves. Correlation using such transforms can tolerate a signiicant number of outliers. This can result in improved performance near obj...

متن کامل

Variable-Block-Size Lapped Transforms [Correspondence] - Signal Processing, IEEE Transactions on

A structure for implementing lapped transforms with timevarying block sizes that allows full orthogonality of the transient transforms is presented. The formulation is based on a factorization of the transfer matrix into orthogonal factors. Such an approach can be viewed as a sequence of stages with variable-block-size transforms separated by sample-shuffling (delay) stages. Details and design ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2001